An OR practitioner’s solution approach to the multidimensional knapsack problem
نویسندگان
چکیده
منابع مشابه
A Hybrid Approach for the 01 Multidimensional Knapsack problem
& is called a knapsack constraint. The special case of the MKP01 with %*!) is the classical knapsack problem (KP01), whose usual statement is the following. Given a knapsack of capacity and objects, each being associated a profit (gain) and a volume occupation, one wants to select + ( +, and + not fixed) objects such that the total profit is maximized and the capacity of the knapsack is not exc...
متن کاملThe Multidimensional Knapsack Problem: Structure and Algorithms
Structure and Algorithms Jakob Puchinger NICTA Victoria Laboratory Department of Computer Science & Software Engineering University of Melbourne, Australia [email protected] Günther R. Raidl Institute of Computer Graphics and Algorithms Vienna University of Technology, Austria [email protected] Ulrich Pferschy Department of Statistics and Operations Research University of Graz, Au...
متن کاملAnt Algorithm for the Multidimensional Knapsack Problem
We propose a new algorithm based on the Ant Colony Optimization (ACO) meta-heuristic for the Multidimensional Knapsack Problem, the goal of which is to find a subset of objects that maximizes a given objective function while satisfying some resource constraints. We show that our new algorithm obtains better results than two other ACO algorithms on most instances.
متن کاملNeural metaheuristics for the multidimensional knapsack problem
The multidimensional knapsack problem (MKP) belongs to a very important class of integer optimization problems. In this study, we propose, develop and test metaheuristics based on the neural-networks paradigm for solving the MKP. We show how domain-specific knowledge can be incorporated within the neural-network framework for solving this NP-Hard problem. We provide a mathematical formulation o...
متن کاملAn Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
We present an Approximate Dynamic Programming (ADP) approach for the multidimensional knapsack problem (MKP). We approximate the value function (a) using parametric and nonparametric methods and (b) using a base-heuristic. We propose a new heuristic which adaptively rounds the solution of the linear programming relaxation. Our computational study suggests: (a) the new heuristic produces high qu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Industrial Engineering Computations
سال: 2020
ISSN: 1923-2926,1923-2934
DOI: 10.5267/j.ijiec.2019.6.004